Analysis of Compressed Sensing with Spatially-Coupled Orthogonal Matrices
نویسندگان
چکیده
Recent development in compressed sensing (CS) has revealed that the use of a special design of measurement matrix, namely the spatially-coupled matrix, can achieve the informationtheoretic limit of CS. In this paper, we consider the measurement matrix which consists of the spatially-coupled orthogonal matrices. One example of such matrices are the randomly selected discrete Fourier transform (DFT) matrices. Such selection enjoys a less memory complexity and a faster multiplication procedure. Our contributions are the replica calculations to find the meansquare-error (MSE) of the Bayes-optimal reconstruction for such setup. We illustrate that the reconstruction thresholds under the spatially-coupled orthogonal and Gaussian ensembles are quite different especially in the noisy cases. In particular, the spatially coupled orthogonal matrices achieve the faster convergence rate, the lower measurement rate, and the reduced MSE.
منابع مشابه
Properties of spatial coupling in compressed sensing
In this paper we address a series of open questions about the construction of spatially coupled measurement matrices in compressed sensing. For hardware implementations one is forced to depart from the limiting regime of parameters in which the proofs of the so-called threshold saturation work. We investigate quantitatively the behavior under finite coupling range, the dependence on the shape o...
متن کاملState Evolution for General Approximate Message Passing Algorithms, with Applications to Spatial Coupling
We consider a class of approximated message passing (AMP) algorithms and characterize their high-dimensional behavior in terms of a suitable state evolution recursion. Our proof applies to Gaussian matrices with independent but not necessarily identically distributed entries. It covers – in particular– the analysis of generalized AMP, introduced by Rangan, and of AMP reconstruction in compresse...
متن کاملApproximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes
We study a compressed sensing solver called Approximate Message-Passing when the i.i.d matrices —for which it has been designed— are replaced by structured operators allowing computationally fast matrix multiplications. We show empirically that after proper randomization, the underlying structure of the operators does not significantly affect the performances of the solver. In particular, for s...
متن کاملMismatch and resolution in compressive imaging
Highly coherent sensing matrices arise in discretization of continuum problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold as well as in using highly coherent, redundant dictionaries as sparsifying operators. Algorithms (BOMP, BLOOMP) based on techniques of band exclusion and local optimization are proposed to enhance Orthogonal Matching Pursuit (OMP)...
متن کاملDeterministic Construction of RIP Matrices in Compressed Sensing from Constant Weight Codes
The expicit restricted isometry property (RIP) measurement matrices are needed in practical application of compressed sensing in signal processing. RIP matrices from Reed-Solomon codes, BCH codes, orthogonal codes, expander graphs have been proposed and analysised. On the other hand binary constant weight codes have been studied for many years and many optimal or near-optimal small weight and d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1402.3215 شماره
صفحات -
تاریخ انتشار 2014